On the set of catenary degrees of finitely generated cancellative commutative monoids

نویسندگان

  • Christopher O'Neill
  • Vadim Ponomarenko
  • Reuben Tate
  • Gautam Webb
چکیده

The catenary degree of an element s of a cancellative commutative monoid S is a nonnegative integer measuring the distance between the irreducible factorizations of s. The catenary degree of the monoid S, defined as the supremum over all catenary degrees occurring in S, has been heavily studied as an invariant of nonunique factorization. In this paper, we investigate the set C(S) of catenary degrees achieved by elements of S as a factorization invariant, focusing on the case where S in finitely generated (where C(S) is known to be finite). Answering an open question posed by Garćıa-Sánchez, we provide a method to compute the smallest nonzero element of C(S) that parallels a well-known method of computing the maximum value. We also give several examples demonstrating certain extremal behavior for C(S), and present some open questions for further study.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Catenary and Tame Degree in Finitely Generated Commutative Cancellative Monoids

A. Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S )) and the tame degree of S (denoted t(S )) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we ...

متن کامل

The catenary and tame degree in finitely generated commutative cancellative monoids

Problems involving chains of irreducible factorizations in atomic integral domains and monoids have been the focus of much recent literature. If S is a commutative cancellative atomic monoid, then the catenary degree of S (denoted c(S)) and the tame degree of S (denoted t(S)) are combinatorial invariants of S which describe the behavior of chains of factorizations. In this note, we describe met...

متن کامل

Primary ideals of finitely generated commutative cancellative monoids

We give a characterization of primary ideals of finitely generated commutative monoids and in the case of finitely generated cancellative monoids we give an algorithmic method for deciding if an ideal is primary or not. Finally we give some properties of primary elements of a cancellative monoid and an algorithmic method for determining the primary elements of a finitely generated cancellative ...

متن کامل

Archimedean Components of Finitely Generated Commutative Monoids

We introduce the concept of presentation for the Archimedean components of finitely generated commutative monoids. Some properties like being cancellative, torsion freeness and separativity are studied under this new point of view.

متن کامل

2 Tullio Ceccherini - Silberstein and Michel Coornaert

AmonoidM is called surjunctive if every injective cellular automata with finite alphabet over M is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all residually finite monoids, all finitely generated linear monoids, and all cancellative one-sided amenable monoids are surjunctive. We also prove that every limit of ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IJAC

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2016